Streaming Capacity in Peer-to-Peer Networks with Topology Constraints

نویسندگان

  • Sudipta Sengupta
  • Shao Liu
  • Minghua Chen
  • Mung Chiang
  • Jin Li
  • Philip A. Chou
چکیده

Peer-to-peer (P2P) systems have shown enormous potential in delivering live streaming content for both IPTV and video conferencing. The fundamental capacity limits of the supported streaming rate by P2P, however, remains unclear, especially with topology constraints. We develop the first unifying framework and approximation algorithms that can compute the streaming capacity of a P2P network over arbitrary overlay topology, number of streaming sessions, and peer selection constraints. Converting a combinatorial multicast tree-selection problem into a linear programming (LP) problem, we show how a primaldual method can be used to handle the difficulty of exponential number of LP variables arising from the combinatorial nature of the P2P streaming capacity problem. Our proposed algorithms for constructively computing P2P streaming capacity establish a benchmark of any P2P system performance. Their effectiveness is demonstrated in simulations based on statistics of uplink capacities of actual Internet hosts.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory

The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...

متن کامل

A Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory

The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...

متن کامل

TAC: A Topology-Aware Chord-based Peer-to-Peer Network

Among structured Peer-to-Peer systems, Chord has a general popularity due to its salient features like simplicity, high scalability, small path length with respect to network size, and flexibility on node join and departure. However, Chord doesn’t take into account the topology of underlying physical network when a new node is being added to the system, thus resulting in high routing late...

متن کامل

Network Architectures for Live Peer-to-Peer Media Streaming

Peer-to-Peer (P2P) media streaming networks, motivated by the huge success of P2P file downloading networks, have recently attracted a lot of research interest. However, it is challenging to design P2P media streaming networks because of the stringent time constraints on the delivered media streams, which require more efficient and resilient overlay architectures. In this paper, we focus on liv...

متن کامل

The performance of locality-aware topologies for peer-to-peer live streaming

This paper is concerned with the effect of overlay network topology on the performance of live streaming peer-to-peer systems. The paper focuses on the evaluation of topologies which are aware of the delays experienced between different peers on the network. Metrics are defined which assess the topologies in terms of delay, bandwidth usage and resilience to peer drop-out. Several topology creat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008